Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors
نویسندگان
چکیده
The main contribution of this work is a new type of graph product, which we call the zig-zag product. Taking a product of a large graph with a small graph, the resulting graph inherits (roughly) its size from the large one, its degree from the small one, and its expansion properties from both! Iteration yields simple explicit constructions of constant-degree expanders of arbitrary size, starting from one constantsize expander. Crucial to our intuition (and simple analysis) of the properties of this graph product is the view of expanders as functions which act as “entropy wave” propagators — they transform probability distributions in which entropy is concentrated in one area to distributions where that concentration is dissipated. In these terms, the graph product affords the constructive interference of two such waves. Subsequent work [ALW01, MW01] relates the zig-zag product of graphs to the standard semidirect product of groups, leading to new results and constructions on expanding Cayley graphs.
منابع مشابه
Randomness Conductors and Constant-Degree Expansion Beyond the Degree / 2 Barrier PRELIMINARY VERSION
The main concrete result of this paper is the first explicit construction of constant degree lossless expanders. In these graphs, the expansion factor is almost as large as possible: , where is the degree and is an arbitrarily small constant. Such graphs are essential components in networks that can implement fast distributed, routing algorithms e.g. [PU89, ALM96, BFU99]. They are useful in exp...
متن کاملRandomness Conductors and Constant-Degree Lossless Expanders [Extended Abstract]
The main concrete result of this paper is the first explicit construction of constant degree lossless expanders. In these graphs, the expansion factor is almost as large as possible: (1− ǫ)D, where D is the degree and ǫ is an arbitrarily small constant. The best previous explicit constructions gave expansion factor D/2, which is too weak for many applications. The D/2 bound was obtained via the...
متن کاملOn Construction of Almost-Ramanujan Graphs
Reingold et al. introduced the notion zig-zag product on two different graphs, and presented a fully explicit construction of dregular expanders with the second largest eigenvalue O(d−1/3). In the same paper, they ask whether or not the similar technique can be used to construct expanders with the second largest eigenvalue O(d−1/2). Such graphs are called Ramanujan graphs. Recently, zig-zag pro...
متن کاملZig-zag and replacement product graphs and LDPC codes
It is known that the expansion property of a graph influences the performance of the corresponding code when decoded using iterative algorithms. Certain graph products may be used to obtain larger expander graphs from smaller ones. In particular, the zig-zag product and replacement product may be used to construct infinite families of constant degree expander graphs. This paper investigates the...
متن کاملAn Explicit Construction of Quantum Expanders
Quantum expanders are a natural generalization of classical expanders. These objects were introduced and studied by [1, 3, 4]. In this note we show how to construct explicit, constant-degree quantum expanders. The construction is essentially the classical Zig-Zag expander construction of [5], applied to quantum expanders.
متن کامل